Exponential Sums over Definable Subsets of Finite Fields
نویسنده
چکیده
We prove some general estimates for exponential sums over subsets of finite fields which are definable in the language of rings. This generalizes both the classical exponential sum estimates over varieties over finite fields due to Weil, Deligne and others, and the result of Chatzidakis, van den Dries and Macintyre concerning the number of points of those definable sets. As a first application, there is no formula in the language of rings that defines for infinitely many primes an “interval” in Z/pZ that is neither bounded nor with bounded complement.
منابع مشابه
On the Solvability of Systems of Bilinear Equations in Finite Fields
can be solved with a ∈ A, b ∈ B, c ∈ C and d ∈ D. Gyarmati and Sárközy [3] generalized the results on the solvability of equation (1.1) to finite fields. They also study the solvability of other (higher degree) algebraic equations with solutions restricted to “large” subsets of Fq, where Fq denote the finite field of q elements. Using exponential sums, Hart and Iosevich [5] studied similar prob...
متن کاملLifts of Points on Curves and Exponential Sums
We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and give bounds for the degrees of their coordinate functions. Then we get bounds for exponential sums, extending results of Kumar et al., Winnie Li over the projective line, and Voloch-Walker over elliptic curves a...
متن کاملExponential sums with Dickson polynomials
We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prime finite fields. This result is motivated by possible applications to polynomial generators of pseudorandom numbers. © 2004 Elsevier Inc. All rights reserved.
متن کاملConstruction of Large Families of Pseudorandom Subsets of the Set {1, 2, ..., N} Using Elliptic Curves
Pseudo-random subsets of the set {1, 2, . . . , N} have many applications in the fields of network security, cryptography and other security issues. Recently, Dartyge and Sárközy investigated the measures–the well distribution measure and the correlation measure of order k–of pseudorandomness of subsets of the set {1, 2, . . . , N}, and they presented several constructive examples for subsets w...
متن کاملOn divisibility of exponential sums of polynomials of special type over fields of characteristic 2
We study divisibility by eight of exponential sums of several classes of functions over finite fields of characteristic two. For the binary classical Kloosterman sums K(a) over such fields we give a simple recurrent algorithm for finding the largest k, such that 2 divides the Kloosterman sum K(a). This gives a simple description of zeros of such Kloosterman sums.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005